Cyclic constructions of distance-preserving mapsLEE, Kwankyu.IEEE transactions on information theory. 2005, Vol 51, Num 12, pp 4392-4396, issn 0018-9448, 5 p.Article

Swap and mismatch edit distanceAMIR, Amihood; EISENBERG, Estrella; PORAT, Ely et al.Algorithmica. 2006, Vol 45, Num 1, pp 109-120, issn 0178-4617, 12 p.Conference Paper

Hamming distance for conjugatesSHALLIT, Jeffrey.Discrete mathematics. 2009, Vol 309, Num 12, pp 4195-4197, issn 0012-365X, 3 p.Article

Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least twoCHANG, Jen-Chun.IEEE transactions on information theory. 2006, Vol 52, Num 4, pp 1683-1689, issn 0018-9448, 7 p.Article

Assessments of neural network classifier output codings using variability of Hamming distanceCHONG, C; JIA, J.Pattern recognition letters. 1996, Vol 17, Num 8, pp 811-818, issn 0167-8655Article

Constacyclic Codes of Length 2^S Over Galois Extension Rings of F₂ + uF₂DINH, Hai Q.IEEE transactions on information theory. 2009, Vol 55, Num 4, pp 1730-1740, issn 0018-9448, 11 p.Article

The shortest path improvement problems under Hamming distanceBINWU ZHANG; JIANZHONG ZHANG; LIQUN QI et al.Journal of combinatorial optimization. 2006, Vol 12, Num 4, pp 351-361, issn 1382-6905, 11 p.Article

New distance-preserving maps of odd lengthLEE, Kwankyu.IEEE transactions on information theory. 2004, Vol 50, Num 10, pp 2539-2543, issn 0018-9448, 5 p.Article

OPTIMAL SUBCUBE EMBEDDABILITY IN HYPERCUBES WITH ADDITIONAL DIMENSIONSYASIM, Shameema; LATIFI, Shahram.Parallel processing letters. 2010, Vol 20, Num 1, pp 91-99, issn 0129-6264, 9 p.Article

Completely regular codesNEUMAIER, A.Discrete mathematics. 1992, Vol 106-7, pp 353-360, issn 0012-365XArticle

Measuring Contour Degradation in Natural Image Utility Assessment: Methods and AnalysisPINTO, Guilherme O; ROUSE, David M; HEMAMI, Sheila S et al.Proceedings of SPIE, the International Society for Optical Engineering. 2011, Vol 7865, issn 0277-786X, isbn 0-8194-8402-4 978-0-8194-8402-4, 78650U.1-78650U.14Conference Paper

HCELP : Low bit rate speech coder for voice storage applicationsBOURAOUI, M; DRUILHE, F. B; FENG, G et al.International conference on acoustics, speech, and signal processing. 1997, pp 739-742, isbn 0-8186-7919-0Conference Paper

The effect of Hamming distances in a computational model of selection by consequencesPOPA, Andrei; MCDOWELL, J. J.Behavioural processes. 2010, Vol 84, Num 1, pp 428-434, issn 0376-6357, 7 p.Conference Paper

One-gapped q-gram filters for Levenshtein distanceBURKHARDT, Stefan; KÄRKKÄINEN, Juha.Lecture notes in computer science. 2002, pp 225-234, issn 0302-9743, isbn 3-540-43862-9, 10 p.Conference Paper

Counting sequences with large local distanceCOHN, M.IEEE transactions on computers. 1985, Vol 34, Num 6, issn 0018-9340, 562Article

Distances sur les mots: application à la recherche de motifs = Distances on the words: application to the motives searchHEBRARD, Jean-Jacques.1984, 112 fThesis

On DC free magnetic recording codes generated by finite state machinesFERREIRA, H.IEEE transactions on magnetics. 1983, Vol 19, Num 6, pp 2691-2693, issn 0018-9464Article

On the distances of cyclic codes of length 2^e over ℤ₄XIAOSHAN KAI; SHIXIN ZHU.Discrete mathematics. 2010, Vol 310, Num 1, pp 12-20, issn 0012-365X, 9 p.Article

MacWilliams Identity for Codes with the Rank MetricGADOULEAU, Maximilien; ZHIYUAN YAN.EURASIP Journal on wireless communications and networking. 2008, issn 1687-1472, ID754021.1-ID754021.13, NS-ADVANCES-IN-ERRORArticle

The number of edges in a subgraph of a Hamming graphSQUIER, R; TORRENCE, B; VOGT, A et al.Applied mathematics letters. 2001, Vol 14, Num 6, pp 701-705, issn 0893-9659Article

Random instance generation for MAX 3SATMOTOKI, Mitsuo.Lecture notes in computer science. 2001, pp 502-508, issn 0302-9743, isbn 3-540-42494-6Conference Paper

A method of examining Orchard codes for minimum hamming distance fiveOTTER, E. L; DEVRIES, R. C.IEEE transactions on communications. 1986, Vol 34, Num 4, pp 399-404, issn 0090-6778Article

On Extracting Common Random Bits From Correlated Sources on Large AlphabetsSIU ON CHAN; MOSSEL, Elchanan; NEEMAN, Joe et al.IEEE transactions on information theory. 2014, Vol 60, Num 3, pp 1630-1637, issn 0018-9448, 8 p.Article

Generalized Hamming weights of Melas codes and dual Melas codesVAN DER GEER, G; VAN DER VLUGT, M.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 4, pp 554-559, issn 0895-4801Article

On fault-tolerant networks for sortingYAO, A. C; YAO, F. F.SIAM journal on computing (Print). 1985, Vol 14, Num 1, pp 120-128, issn 0097-5397Article